The two-dimensional bin packing problem with variable bin sizes and costs
نویسندگان
چکیده
منابع مشابه
Three-dimensional bin packing problem with variable bin height
This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin height can be adjusted to the cartons it packs. The bins and cartons to be packed are assumed rectangular in shape. The cartons are allowed to be rotated into any one of the six positions that keep the carton edges parallel to the bin edges. This greatly increases the difficulty of finding a good s...
متن کاملBin-Packing Problem with Concave Costs of Bin Utilization
We consider a generalized one-dimensional bin-packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin-packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst-case performances when they are applied...
متن کاملSolving the Two-Dimensional Bin-Packing Problem with Variable Bin Sizes by Greedy Randomized Adaptive Search Procedures and Variable Neighborhood Search
Introduction. In this work we consider a special variant of a two-dimensional bin packing problem where a finite number of bins of different dimensions are given, and a given set of two-dimensional rectangular items must be packed into (a subset of) these bins. This problem obviously has many practical applications, e.g. in the wood, glass and metal industry. For this particular problem variant...
متن کاملOn-Line Extensible Bin Packing with Unequal Bin Sizes
In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and give the complete analysis on a list scheduling algorithm (LS). Namely we present tight bo...
متن کاملTwo-Dimensional On-Line Bin Packing Problem with Rotatable Items
In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is “rotatable” by 90 ◦ . Two on-line algorithms for solving the problem are proposed. The second algorithm is an extension of the 2rst algorithm, and the worst-case ratio of the second one is at least 2.25 and at most 2.565. c © 2002...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2005
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2005.01.002